Test Pattern Length Required to Reach the Desired Fault Coverage

نویسنده

  • Junichi Hirase
چکیده

An essential point in VLSI (very large scale integration) testing is to build a testing strategy that can produce the best solution for the selection of a testing method which takes into account such factors as quality, cost (chip area, yield, testing cost, etc.), performances, power dissipation and time for the development project, as well as for the determination of the role of the tester. For this purpose, it is important to know the relationship between the fault coverage F and the pattern length L in order to obtain the testing cost and the defect level that will serve as the quality indicator. Some studies have already disclosed the relationship between the fault coverage of pseudo random-number generation patterns and the pattern length in BIST. In these studies, the discussion uses a delta function for the distribution function of the detected faults. However we discuss conventional testing methods, with the exception of BIST, as well as the relationship between the fault coverage and the pattern length based on the assumption that the distribution function of the detected faults is a gamma distribution. Under this assumption, the probability of fault detection becomes the negative binominal distribution from the binominal distribution and is approximated as the negative hypergeometric distribution. Since, based on the definition of the negative hypergeometrical distribution and on the definition of the negative binominal distribution, the clustering parameter k plus the number of detected faults M represents the number of trials, the subject of our discussion therefore indicates the length of the execution test pattern. Then we assume that pattern compression and expansion are in proportion to the total fault number N and to the detected fault number. And we assume that pattern compression and expansion are in inverse proportion to the number of terminals P. As we can assume that the total number of detected faults is given by the greatest value of detected faults, we assume that the total number of faults detected by the test pattern is the mean value plus 3 sigmas of the negative binominal distribution. Consequently we can get the execution test pattern length. Here, with C as the pattern compression coefficient, the execution test pattern length L is given by the following equation. L=CN/P M(k+M) =CN/P [kF/(1-F)+3(kF)/(1-F)] [k+kF/(1-F)+3(kF)/(1-F)]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Transformed Pseudo-Random Patterns for BIST - VLSI Test Symposium, 1995. Proceedings., 13th IEEE

This paper presents a new approach for on-chip test pattern generation. The set of test patterns generated by a pseudo-random pattern generator (e.g., an LFSR) is transformed into a new set of patterns that provides the desired fault coverage. The trang5ormation is performed by a small amount of mapping logic that decodes sets of patterns that don't detect any new faults and maps them into patt...

متن کامل

Transformed pseudo-random patterns for BIST

This paper presents a new approach for on-chip test pattern generation. The set of test patterns generated by a pseudo-random pattern generator (e.g., an LFSR) is transformed into a new set of patterns that provides the desired fault coverage. The transformation is performed by a small amount of mapping logic that decodes sets of patterns that don’t detect any new faults and maps them into patt...

متن کامل

Synthesis of Mapping Logic for Generating Transformed Pseudo-Random Patterns for BIST

During built-in self-test (BIST), the set of patterns generated by a pseudo-random pattern generator may not provide a sufficiently high fault coverage. This paper presents a new technique for synthesizing combinational mapping logic to transform the set of patterns that are generated. The goal is to satisfy test length and fault coverage requirements while minimizing area overhead. For a given...

متن کامل

SYNTHESIS OF MAPPING LOGIC FOR GENERATING TRANSFORMED PSEUDO-RANDOM PATTERNS FOR BIST - Test Conference, 1995. Proceedings., International

During built-in self-test (BIST), the set of patterns generated by a pseudo-random pattern generator may not provide a sufficiently high fault coverage. This paper presents a new technique for synthesizing combinational mapping logic to transform the set of patterns that are generated. The goal is to satisfy test length and fault coverage requirements while minimizing area overhead. For a given...

متن کامل

BIST Test Pattern Generator Based on Partitioning Circuit Inputs

The test length required to achieve a high fault coverage for random pattern resistant circuits when using pseudorandom patterns is unacceptably large. In order to reduce this test length, the circuit inputs are partitioned based on a set of vectors generated by an ATPG tool for the faults that are hardest to detect. The partition is chosen by a simple heuristic of counting the number of ones a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003